An iterative dynamic programming approach for the temporal knapsack problem

In this paper, we address the temporal knapsack problem (TKP), a generalization of classical problem, where selected items enter and leave at fixed dates. We model TKP with dynamic program exponential size, which is solved using method called Successive Sublimation Dynamic Programming (SSDP). This starts by relaxing set constraints from initial iteratively reintroduces them when needed. show that direct application SSDP to does not lead an effective method, several improvements are needed compete best results literature.